Segmentation of tissue architecture by distance graph matching

Segmentation of tissue architecture by distance graph matching.

BACKGROUND Characterization of tissues can be based on the topographical relationship between the cells. Such characterization should be insensitive to distortions intrinsic to the acquisition of biological preparation. In this paper, a method for the robust segmentation of tissues based on the spatial distribution of cells is proposed. MATERIALS AND METHODS The neighborhood of each cell in t...

Map Edit Distance vs. Graph Edit Distance for Matching Images

Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). We have introduced in [1] a map edit distance. This distance compares maps by means of a minimum cost sequence of edit operations that should be performed to transform a map into another...

Approximate graph edit distance computation by means of bipartite graph matching

In recent years, the use of graph based object representation has gained popularity. Simultaneously, graph edit distance emerged as a powerful and flexible graph matching paradigm that can be used to address different tasks in pattern recognition, machine learning, and data mining. The key advantages of graph edit distance are its high degree of flexibility, which makes it applicable to any typ...

The Matching Polynomial of a Distance-regular Graph

A distance-regular graph of diameter d has 2d intersection numbers that determinemany properties of graph (e.g., its spectrum). We show that the first six coefficients of the matching polynomial of a distance-regular graph can also be determined from its intersection array, and that this is the maximum number of coefficients so determined. Also, the converse is true for distance-regular graphs ...

Bipartite Graph Matching for Computing the Edit Distance of Graphs